Automated Proof of Resistance of Denial of Service Attacks in Remote Internet Voting Protocol with Extended Applied Pi Calculus

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification of Resistance of Denial of Service Attacks in Extended Applied Pi Calculus with ProVerif

Owning to the damage of denial of service attacks in security protocols, resistance of denial of service attacks plays an important role in remote voting protocols. Recently Meng et al. proposed a secure remote internet voting protocol that claims to satisfy formal definitions of key properties without physical constrains. In this study firstly the review of the formal model of resistance of de...

متن کامل

Mechanized Proof of Resistance of Denial of Service Attacks in Voting Protocol with ProVerif

Resistance of denial of service attacks is a key security requirement in voting protocols. Acquisti protocol plays an important role in development of internet voting protocols and claims its security without strong physical assumptions. In this study firstly Acquisti protocol is modeled in extended applied pi calculus, and then resistance of denial of service attacks is proved with ProVerif. T...

متن کامل

Automatic Verification of Security Properties in Remote Internet Voting Protocol with Applied Pi Calculus

Soundness and coercion resistance are the important and intricate security requirements for remote voting protocols. Several formal models of soundness and coercion-resistance have been proposed in the literatures, but these formal models are not supported by automatic tools. Recently Backes et al. propose a new formal automated model of security properties including soundness and coercionresis...

متن کامل

Analysis of Receipt-freeness in the Internet Voting Protocol with Applied Pi Calculus

The practical Internet voting protocols should have: privacy, completeness, soundness, unreusability, fairness, eligibility, and invariableness, universal verifiability, receipt-freeness, and coercion-resistance. Privacy describes the fact that a particular vote in a particular way is not revealed to anyone. Receipt-freeness means that the voter can not produce a receipt to prove that he votes ...

متن کامل

Automated Proof of Resistance of Denial of Service Attacks Using Event with Theorem Prover

The huge damage of denial of service attacks in security protocols attracts researchers’ attention and effort to analysis, verification and prevention of denial of service attacks. In order to model resistance of denial of service attacks, firstly, we extend applied pi calculus from both adversary context and processes aspects; secondly, the first computer-aided method of resistance of denial o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Technology Journal

سال: 2011

ISSN: 1812-5638

DOI: 10.3923/itj.2011.1468.1483